Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms
نویسندگان
چکیده
منابع مشابه
Linear-time approximation algorithms for minimum subset sum and subset sum
We present a family of approximation algorithms for minimum subset sum with a worst-case approximation ratio of (k + 1)/k and which run in linear time assuming that k is constant. We also present a family of linear-time approximation algorithms for subset sum with worst-case approximation factors of k/(k+1) assuming that k is constant. The algorithms use approaches from and improve upon previou...
متن کاملPopularity Teaching - Ability Course Difficulty Rating Instructor Registration Course
Probabilistic relational models (PRMs) are a rich representation language for structured statistical models. They combine a frame-based logical representation with probabilistic semantics based on directed graphical models (Bayesian networks). This chapter gives an introduction to probabilistic relational models, describing semantics for attribute uncertainty, structural uncertainty, and class ...
متن کاملAdjusting GPA to Reflect Course Difficulty
The computation of Graduate Point Average (GPA) incorrectly assumes that grades are comparable across courses and instructors. GPA overstates the performance of students who elect an “easier” course of study relative to those who choose a more “difficult” course of study. This paper proposes a method of adjusting GPA and applies it to data from one cohort of undergraduates at Carnegie Mellon Un...
متن کاملQuantum Algorithms for the Subset-Sum Problem
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham–Joux subset-sum algorithm with a new streamlined data structure for quantum walks on Johnson graphs.
متن کاملPriority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework (Borodin et al. in Algorithmica 37:295–326, 2003) captures a key notion of “greediness” in the sense that it processes (in some locally optimal manner) one data item at a time, depending on and only on the current knowledge of the input. This algorithmic model provides a tool to assess the comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cybernetics and Information Technologies
سال: 2019
ISSN: 1314-4081
DOI: 10.2478/cait-2019-0024